An Explication of Secret Sharing Schemes with General Access Structure
نویسندگان
چکیده
The basic idea in secret sharing is to divide the secret key into pieces, also called as ‘shares’ and distribute the pieces to different persons so that certain subsets of the persons can get together to recover the key. In the outline of threshold schemes, we wanted k out of n participants to be able to determine the key. In practice, it is often needed that only certain specified subsets of the participants should be able to recover the secret. A more general situation is to specify exactly which subsets of participants should be able to determine the key and those that should not. The Access structure describes all the authorized subsets to design the access structure with required capabilities. The goal of the general access structure secret sharing scheme is to provide the flexibility to decide which specified subsets of participants will able to reconstruct the original secret and which subsets cannot. The intent of this paper is to provide an analysis of some existing General Access Structure Secret Sharing Schemes. The comparative study shows there is a need of better General Access Structure scheme to fulfil the need of applications.
منابع مشابه
An Explication of Secret Sharing Schemes
This paper is an explication of secret sharing schemes, emphasizing combinatorial construction methods. The main problem we consider is the construction of perfect secret sharing schemes, for specified access structures, with the maximum possible information rate. In this paper, we present numerous direct constructions for secret sharing schemes, such as the Shamir threshold scheme, the Boolean...
متن کاملAn Explication of Multifarious Secret Sharing Schemes
The idea of secret sharing is to start with a secret, divide it into pieces called shares, which are then distributed amongst participants by the dealer. Only certain authorized subsets of participants can reconstruct the original secret. Applications for secret sharing schemes seem to be getting more important nowadays. For many circumstances, secret sharing has to provide more flexibility and...
متن کاملSecurity Analysis of a Hash-Based Secret Sharing Scheme
Secret sharing schemes perform an important role in protecting se-cret by sharing it among multiple participants. In 1979, (t; n) threshold secret sharing schemes were proposed by Shamir and Blakley independently. In a (t; n) threshold secret sharing scheme a secret can be shared among n partic-ipants such that t or more participants can reconstruct the secret, but it can not be reconstructed b...
متن کاملA Fast Publicly Verifiable Secret Sharing Scheme using Non-homogeneous Linear Recursions
A non-interactive (t,n)-publicly veriable secret sharing scheme (non-interactive (t,n)-PVSS scheme) is a (t,n)-secret sharing scheme in which anyone, not only the participants of the scheme, can verify the correctness of the produced shares without interacting with the dealer and participants. The (t,n)-PVSS schemes have found a lot of applications in cryptography because they are suitable for<...
متن کاملEfficient Secret Sharing Schemes Based on Unauthorized Subsets
We propose efficient secret sharing schemes realizing general access structures. Our proposed schemes are perfect secret sharing schemes and include Shamir’s (k, n)-threshold schemes as a special case. Furthermore, we show that a verifiable secret sharing scheme for general access structures is realized by one of the proposed schemes. key words: (k, n)-threshold scheme, general access structure...
متن کامل